The centdian subtree on tree networks

نویسندگان

Arie Tamir

Justo Puerto

Dionisio Pérez-Brito

چکیده

This paper describes an O(n log n) algorithm for 2nding the optimal location of a tree shaped facility of a speci2ed size in a tree network with n nodes, using the centdian criterion: a convex combination of the weighted average distance and the maximum weighted distance from the facility to the demand points (nodes of the tree). These optimization criteria introduced by Halpern, combine the weighted median and weighted center objective functions. Therefore they capture more real-world problems and provide good ways to trade-o8 minisum (e9ciency) and minimax (equity) approaches. ? 2002 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree

In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...

متن کامل

Placing and maintaining a core node in wirelessad hoc networks

Wireless ad hoc networks are characterized by several performance metrics, such as bandwidth, transport, delay, power, etc. These networks are examined by constructing a tree network. A core node is usually chosen to be the median or center of the multicast tree network with a tendency to minimize a performance metric, such as delay or transport. In this paper, we present a new efficient strate...

متن کامل

Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks

Wireless Ad hoc sensor networks are characterized by several constraints, such as bandwidth, delay, power, etc. These networks are examined by constructing a tree network. A core node usually chosen to be the median or center of the multicast tree network with a tend to minimize a performance metric, such as delay or bandwidth. In this paper, we present new efficient strategy for constructing a...

متن کامل

Centdian Computation for Sensor Networks

This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a conve...

متن کامل